منابع مشابه
CS 369 E : Expanders in Computer Science
for their meticulous note-taking. We also thank Microsoft Research and the Computer Science Department at Stanford. We had indeed advertised that we will be covering recent results in the course announcement. We had planned to cover Reingold's new result " SL=L " , which we presented in lecture as scheduled. Little did we expect that Irit Dinur would come up with a simple proof of the PCP Theor...
متن کاملE-Learning of Foundation of Computer Science
We report our teaching experience of undergraduate courses on logic and computation. The topics covered are the syntax and the semantics of basic logical and computational calculi. We put our emphasis on the treatment of formal systems and formal reasoning which is notoriously difficult for most students. To overcome this difficulty, we developed an e-learning system called CAL and have been us...
متن کاملControl from Computer Science 1
This paper presents some of the principles underlying veriication and controller synthesis techniques for discrete dynamical systems developed within Computer Science along with some ideas to extend them to continuous and hybrid systems. Hopefully, this will provide control theorists and engineers with an additional perspective of their discipline as seen by a sympathetic outsider, uncommitted ...
متن کاملFrom constructivism to computer science 1
Preamble My ÿeld is mathematical logic, with a special interest in constructivism, and I would not dare to call myself a computer scientist. But some computer scientists regard my work as a contribution to their ÿeld; and in this text I shall try to explain how this is possible, by taking a look at the history of ideas. I want to describe how two interrelated ideas, connected with the construct...
متن کاملThe Logic in Computer Science Column 1
Quisani: Hello. It's that time of the year again when we have a discussion, isn't it? Author: Come on in. It is a busy time but I am happy to see you. Q: I am afraid my mood is rather critical today. A: That is all right. Speak your mind. Q: It is about computability and decidability. It seems to me that logicians' computability has little to do with real computability. Some so-called computabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGCSE Bulletin
سال: 2007
ISSN: 0097-8418
DOI: 10.1145/1227504.1227446